Location:
Search - NFA DFA
Search list
Description: 实现NFA到DFA的转换，是编译原理初学者比较好的参考资料-Achieve NFA to DFA conversion, the principle is to compile a better reference for beginners
Platform: |
Size: 2048 |
Author: ZWL |
Hits:
Description: 正则式到有穷自动机 最近刚学了编译原理 搞出来得这个东西。 有限自动机的确定华，NFA到DFA的转变。
-Is the type that the DFA has recently learned a compiler to produce more of the principle of things. Determination of finite automata China, NFA to DFA transformation.
Platform: |
Size: 12288 |
Author: 郭称平 |
Hits:
Description: 实现NFA到DFA的转换过程。文件中包含输入格式 见txt 文档-Turn NFA to DFA
Platform: |
Size: 769024 |
Author: 张丹 |
Hits:
Description: 课程设计用到的正则表达式到最小DFA的转化-r->NFA->DFA->min DFA
Platform: |
Size: 5120 |
Author: 星飞感受 |
Hits:
Description: 从NFA到DFA的转换过程是利用NFA的信息不断生成DFA的状态结点和边的过程，或者说是生成DFA自动机转换表元素的过程。求ε-闭包也就是把用ε边连接起来的状态合并起来的过程，被合并的状态集将形成DFA的一个状态，因此DFA的状态被表示为NFA的状态子集。
用SS(状态集)的形式表示DFA的状态。假设SS表示新产生的状态，则下一步的工作是：对每个符号a考虑其边和该边的指向状态。
-From the NFA to DFA conversion process is the use of information continuously generated NFA state DFA nodes and edges of the process, or to generate automata DFA conversion table of the process elements. Ε-closure order is to connect with ε while the status of the process of merging, the merger will form the state set a state of DFA, the DFA state is expressed as a subset of the state of NFA. With SS (state set) of the form of the state DFA. SS assumptions that the status of the newly elected, the next step is: for each symbol a consideration of its edge and the edge point to state.
Platform: |
Size: 210944 |
Author: 董华鹏 |
Hits:
Description: 完成从nfa向dfa的转换，即非确定性有限自动机向确定性有限自动机的转化-NFA to DFA
Platform: |
Size: 666624 |
Author: tianyi |
Hits:
Description: Uploading, This program use to convert nfa to dfa.
Platform: |
Size: 19456 |
Author: Pham Thien Truong |
Hits:
Description: 本程序主要是使用“子集法”实现NFA的确定化，使用“分割法”实现DFA的最小化，在本程序中用到的主要的数据结构是数组，这些数组是用来存放NFA的初始状态集，及确定化和最小化后的状态矩阵。-This procedure is mainly the use of " sub-set method" to achieve the determination of NFA, the use of " segmentation" to achieve a minimum of DFA in this program used in the main data structure is an array, these arrays are used to store the initial NFA beginning of the state set, and the identification of and minimize the state after the matrix.
Platform: |
Size: 401408 |
Author: lihaixia |
Hits:
Description: 这是由RE转NFA再转DFA，最后识别的程序。参考了龙书和陈火旺的书，此程序最终完成的是下面网站要求的功能。http://info.ruc.edu.cn/wangqiuyue/comp_theory.htm-这是由RE转NFA再转DFA，最后识别的程序。参考了龙书和陈火旺的书，http://info.ruc.edu.cn/wangqiuyue/comp_theory.htm
Platform: |
Size: 16384 |
Author: lixmin |
Hits:
Description: 消除文法的左递归，实现文法的化简以及NFA与DFA的转换-Elimination of left recursive grammar to achieve grammatical simplification, as well as conversion of NFA and DFA
Platform: |
Size: 43008 |
Author: yao |
Hits:
Description: NFA to DFA (c++) with c++ langage.
Platform: |
Size: 2048 |
Author: djongar |
Hits:
Description: convert nfa to dfa
this program neveshte shode dar c++ builder
Platform: |
Size: 389120 |
Author: moein |
Hits:
Description: convert nfa to dfa
this program neveshte shode dar c++ builder
Platform: |
Size: 1024 |
Author: moein |
Hits:
Description: user enter one dfa or nfa and program check this automat is nfa or dfa
Platform: |
Size: 495616 |
Author: barfoyakh |
Hits:
Description: 编译原理的词法分析器。可以解析正则表达式。生成NFA及DFA-Compilation Principle of lexical analyzer. Regular expressions can be resolved. Build NFA and DFA
Platform: |
Size: 211968 |
Author: 陈晨 |
Hits:
Description: 词法分析器，NFA转DFA，程序自动建立存储结构-Lexical analyzer, NFA transfer DFA, program automatically creates the storage structure
Platform: |
Size: 1349632 |
Author: 李睿 |
Hits:
Description: 正则表达式及nfa到dfa再到mfa的转化-Regular expressions and nfa to dfa conversion and then to mfa
Platform: |
Size: 8192 |
Author: 李睿 |
Hits:
Description: 手工构造一个能够识别C语言的所有典型单词，如：标识符、数字、运算符，和if、while等保留字的确定有限自动机，并写出对应该自动机的程序；然后以一个简化的C语言程序为输入文件，通过所设计的基于上述自动机的词法分析程序获得输入文件中的各个单词及其内码对照表，并以文件形式保存结果（也就是TOKEN序列）。
将自己定义的各个正则表达式转化为NFA，然后将其综合为NFA ，再将NFA 转化为DFA，再将DFA转化为最少状态的DFA ，最后由DFA 转化为词法分析程序。-Manually construct a C language to identify all the typical words such as: identifiers, numbers, operators, and if, while the determination of reserved words such as finite automata, and write on the procedure should be automatic machine then a simplified C language program for the input file, through the design of automata based on the lexical analysis procedure for obtaining the input file and within each code word table, and save the results to file the form (that is, TOKEN sequence). Defining themselves in all the regular expression into NFA, and then consolidated for the NFA ' , then NFA' into a DFA, DFA then converted to a minimum state DFA ' , the last by the DFA' into a lexical analysis program.
Platform: |
Size: 337920 |
Author: 罗丹 |
Hits:
Description: **本次实验在Visual Studio.NET 2003环境下开发**
此压缩包内包括以下五个文件：
1.Lex的源代码文件 Lex.cpp
2.Lex的测试输入文件 test.txt
3.测试文件需包含的头文件 yytab.h
4.经过Lex生成的结果文件yylex.cpp
5.说明
关于Lex:
本实验中完成的Lex可以完成以下算法：
1.输入文件解析
2.多个NFA合并
3.NFA转换DFA
4.最小化DFA
5.生成代码
关于输入文件格式：
此Lex的缺点是对输入文件的错误识别能力较弱，并且如不按照格式要求书写输入文件，可能会使程序
报错。这个缺点，我们会尽快改正。
此Lex所使用的特殊符号：
[]{}()|*
其中若在需要识别的串中使用[]()|*，则在前面加上\即可，例如：需要识别||,[,则写成\|\|,\[即可。-Visual Studio.NET 2003
source :lex.cpp
Platform: |
Size: 652288 |
Author: 王伟 |
Hits:
Description: .定义一个圆类，具有成员函数能分别计算圆的周长、面积，要求采用构造函数初始化圆对象，且在释放圆对象时能输出“The circle is free!”信息。
-DFA-NFA
Platform: |
Size: 885760 |
Author: jiangzhili |
Hits:
«
1
2
...
5
6
7
8
9
1011
12
13
»